Common Subsequences and Supersequences and Their expected Length
نویسنده
چکیده
Let f(n; k; l) be the expected length of a longest common subse-quence of l sequences of length n over an alphabet of size k. It is known that there are constants (l) k such that f(n; k; l) ! (l) k n, we show that (l) k = (k 1=l?1). Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.
منابع مشابه
Analysis of the Relationships among Longest Common Subsequences, Shortest Common Supersequences and Patterns and its application on Pattern Discovery in Biological Sequences
For a set of multiple sequences, their patterns, Longest Common Subsequences (LCS) and Shortest Common Supersequences (SCS) represent different aspects of these sequences' profile. Revealing the relationship between the patterns and LCS/SCS might provide us with a deeper view of the patterns. In this paper, we have showed that patterns LCS and SCS were closely related to each other. Based on th...
متن کاملProblems Related to Subsequences and Supersequences
We present an algorithm for building the automaton that searches for all non-overlapping occurrences of each subsequence from the set of subsequences. Further, we define Directed Acyclic Supersequence Graph and use it to solve the generalized Shortest Common Supersequence problem, the Longest Common Non-Supersequence problem, and the Longest Consistent Supersequence problem.
متن کاملFrom Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted by the number of times the received subsequence can be embedded in them. In a previous work it is conjectured on the basis of experimental data th...
متن کاملOn the Approximation of Shortest Common Supersequences and Longest Common Subsequences
The problems of finding shortest common supersequences (SCS) and longest common subsequences (LCS) are two well-known NP-hard problems that have applications in many areas, including computational molecular biology, data compression, robot motion planning, and scheduling, text editing, etc. A lot of fruitless effort has been spent in searching for good approximation algorithms for these problem...
متن کاملDecidability in the Logic of Subsequences and Supersequences
We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the Σ2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of variables, we show that the FO2 theory is decidable while the FO3 theory is undecidable. 1998 ACM Subject Classification F.4.1 Mathematical Logic, F.4.3 Formal Lan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 7 شماره
صفحات -
تاریخ انتشار 1995